package tests;

import trees.BPlusTree;
import junit.framework.TestCase;

public class BPlusTreeTest extends TestCase {

	public void testBPlusTree() {
		BPlusTree<Integer> tree = new BPlusTree<Integer>(1);
		int[] insertList = new int[]{1,4,6,9,11,17,3,6,8,3,54,-12};
		for (int element : insertList)
			tree.insert(element, element);
		
//		tree.
	}

	public void testSearch() {
//		fail("Not yet implemented");
	}

	public void testInsert() {
		
	}

}
